Edge and Node Searching Problems on Trees
نویسندگان
چکیده
In this paper we consider the edge searching and node searching problems on trees Given a tree we show a transformation from an optimal node search strategy to an optimal edge search strategy Using our transformation we simplify a previous linear time algorithm for determining the edge search number of a tree and improve the running time of a previous algorithm for constructing an optimal edge search strategy of an n vertex tree from O n logn to O n We also improve the running time of a previous algorithm for constructing an optimal min cut linear layout of an n vertex tree with the maximum degree three from O n logn to O n
منابع مشابه
Similarity Metric for XML Documents
Since XML documents can be represented as trees, Based on traditional tree edit distance, this paper presents structural similarity metric for XML documents ,which is based on edge constraint, path constraint, and inclusive path constraint, and similarity metric based on machine learning with node costs. It extends scope for searching XML documents, and improves recall and precision for searchi...
متن کاملGraph Searching on Chordal Graphs
In the graph searching problem initially a graph with all edges contaminated is pre sented We would like to obtain a state of the graph in which all edges are simultaneously clear by a sequence of moves using searchers The objective is to achieve the desired state by using the least number of searchers Two variations of the graph searching problem are considered in this paper One is the edge se...
متن کاملThe Coast of Searching in General Trees versus Complete Binary Trees
We consider the problem of searching in natural families of trees. A search in a tree T is a sequence of queries used to locate a pre-designated node called the \buggy" node. A query is made to any subtree in T. If the queried subtree contains the buggy node, then we restrict the search to that subtree, otherwise the search is restricted to the complement of that subtree in T. Two problems are ...
متن کاملUnderstorey bird responses to the edge-interior gradient in an isolated tropical rainforest of Malaysia
Forest fragmentation results in a loss of forest interior and an increase in edge habitat. We studied how understorey bird community composition and habitat variables changed along an edge-to-interior gradient in a 1248-ha lowland rainforest patch in peninsular Malaysia. Birds and environmental variables such as vegetation structure and litter depth were detected within a 25-m radius of each of...
متن کاملSearching the Nodes of a Graph: Theory and Algorithms
One or more searchers must capture an invisible evader hiding in the nodes of a graph. We study this version of the graph search problem under additional restrictions, such as monotonicity and connectedness. We emphasize that we study node search, i.e., the capture of a node-located evader; this problem has so far received much less attention than edge search, i.e., the capture of an edge-locat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 240 شماره
صفحات -
تاریخ انتشار 1997